- classical negation
- мат.классическое отрицание
English-Russian scientific dictionary. 2008.
classical negation
Смотреть что такое "classical negation" в других словарях:
Negation as failure — (NAF, for short) is a non monotonic inference rule in logic programming, used to derive (i.e. that is assumed not to hold) from failure to derive . Note that can be different from the statement of the logical negation of … Wikipedia
Negation — For other uses, see Negation (disambiguation). In logic and mathematics, negation, also called logical complement, is an operation on propositions, truth values, or semantic values more generally. Intuitively, the negation of a proposition is… … Wikipedia
Classical logic — identifies a class of formal logics that have been most intensively studied and most widely used. The class is sometimes called standard logic as well.[1][2] They are characterised by a number of properties:[3] Law of the excluded middle and… … Wikipedia
Negation (linguistics) — In rhetoric, where the role of the interpreter is taken into consideration as a non negligible factor, negation bears a much wider range of functions and meanings than it does in logic, where the interpretation of signs for negation is… … Wikipedia
Negation normal form — A logical formula is in negation normal form if negation occurs only immediately above elementary propositions, and { } are the only allowed Boolean connectives. In classical logic each formula can be brought into this form by replacing… … Wikipedia
double negation — The result of negating the negation of a proposition. In classical propositional calculus, ¬¬ p is equivalent to p . In intuitionistic logic this is not so; we cannot infer p from ¬¬ p … Philosophy dictionary
Logic programming — is, in its broadest sense, the use of mathematical logic for computer programming. In this view of logic programming, which can be traced at least as far back as John McCarthy s [1958] advice taker proposal, logic is used as a purely declarative… … Wikipedia
Stable model semantics — The concept of a stable model, or answer set, is used to define a declarative semantics for logic programs with negation as failure. This is one of several standard approaches to the meaning of negation in logic programming, along with program… … Wikipedia
Begriffsschrift — is the title of a short book on logic by Gottlob Frege, published in 1879, and is also the name of the formal system set out in that book. Begriffsschrift is usually translated as concept writing or concept notation ; the full title of the book… … Wikipedia
Ivan Orlov — Orlov, Ivan Efimovich (October 1 (old style) 1886 Galich, Kostroma district Russia – 1936) was a philosopher, a forerunner of relevant and other substructural logics, and an industrial chemist. The date of his death is unknown but is believed to… … Wikipedia
Bossam — is an inference engine ( a Semantic Reasoner) for the semantic web. It is basically a RETE based rule engine with native supports for reasoning over OWL ontologies, SWRL ontologies, and RuleML rules.Additionally, Bossam includes several… … Wikipedia
